Local routing algorithms for node-capacitated multicommodity broadcast
نویسندگان
چکیده
Given a directed network with upload and download capacities at nodes, we consider the multicommodity relay-free multicast problem: there are k multicast sessions, each with a source si ∈ V , receiver set Ri ⊆ V and demand λi > 0, with the constraint that nodes only forward packets of commodities for which they are also a receiver. When each Ri is a clique, we prove that whenever demands {λi + ε} are feasible, a simple local-control routing algorithm is stable under demands {λi}. We also give a randomized procedure for resampling neighbours that allows the use of bounded-degree neighbourhoods.
منابع مشابه
Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملNode-Capacitated Ring Routing
We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation, the node-capacitated multicommodity flow problem. For the feasibility problem, Farkas’ lemma provides a characterization for general undirected graphs asserting roughly that there exists such a flow if and only if the so-called distance inequality holds for every choice of distan...
متن کاملA Comparison of Four Multi-Objective Meta-Heuristics for a Capacitated Location-Routing Problem
In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...
متن کاملLeast cost heuristic for the delay-constrained capacitated minimum spanning tree problem
This study deals with the Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) problem arising in topology discovery of local network. While the traditional Capacitated Minimum Spanning Tree (CMST) problem deals with only traffic capacity constraint of a port of a source node, and Delay-Constrained Minimum Spanning Tree (DCMST) considers only the maximum end-to-end delay constraint, th...
متن کاملSending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems
We consider natural generalizations of the minimum broadcast time problem under the telephone model, where a rumor from a root node must be sent via phone calls to the whole graph in the minimum number of rounds; the telephone model implies that the set of edges involved in communicating in a round form a matching. The extensions we consider involve generalizing the number of calls that a verte...
متن کامل